Discrete Approximation of Non-compact Operators Describing Continuum-of-alleles Models

نویسنده

  • Oliver Redner
چکیده

We consider the eigenvalue equation for the largest eigenvalue of certain kinds of non-compact linear operators given as the sum of a multiplication and a kernel operator. It is shown that, under moderate conditions, such operators can be approximated arbitrarily well by operators of finite rank, which constitutes a discretization procedure. For this purpose, two standard methods of approximation theory, the Nyström and the Galerkin method, are generalized. The operators considered describe models for mutation and selection of an infinitely large population of individuals that are labeled by real numbers, commonly called continuum-of-alleles (COA) models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discretization of Continuum–of–Alleles Models

We consider models for mutation and selection of an infinitely large population of individuals that are described by real numbers, commonly called continuum-of-alleles (COA) models. It is shown that such models can be approximated arbitrarily well by models with a finite number of types, which constitutes a discretization procedure. For this purpose, two standard methods of approximation theory...

متن کامل

A degenerate kernel method for eigenvalue problems of non-compact operators with applications in electromagnetism and continuum-of-alleles models

We consider the eigenvalue problem of certain kind of non-compact linear operators given as the sum of a multiplication and a kernel operator. A degenerate kernel method with piecewise linear interpolation with respect to the second variable is used to approximate eigenvalues. It is shown that the error is of order O(h). A bound for the condition number of this method is obtained. By a numerica...

متن کامل

SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

متن کامل

Parameter Estimation in Spatial Generalized Linear Mixed Models with Skew Gaussian Random Effects using Laplace Approximation

 Spatial generalized linear mixed models are used commonly for modelling non-Gaussian discrete spatial responses. We present an algorithm for parameter estimation of the models using Laplace approximation of likelihood function. In these models, the spatial correlation structure of data is carried out by random effects or latent variables. In most spatial analysis, it is assumed that rando...

متن کامل

Dilations‎, ‎models‎, ‎scattering and spectral problems of 1D discrete Hamiltonian systems

In this paper, the maximal dissipative extensions of a symmetric singular 1D discrete Hamiltonian operator with maximal deficiency indices (2,2) (in limit-circle cases at ±∞) and acting in the Hilbert space ℓ_{Ω}²(Z;C²) (Z:={0,±1,±2,...}) are considered. We consider two classes dissipative operators with separated boundary conditions both at -∞ and ∞. For each of these cases we establish a self...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004